A result in queueing theory

Queueing Theory

Queueing Theory

A queue is a waiting line (like customers waiting at a supermarket checkout counter); queueing theory is the mathematical theory of waiting lines. More generally, queueing theory is concerned with the mathematical modeling and analysis of systems that provide service to random demands. A queueing model is an abstract description of such a system. Typically, a queueing model represents (1) the s...

A : Elements of Queueing Theory

APPENDIX A: ELEMENTS OF QUEUEING THEORY In a packet radio network, packets/messages are forwarded from node to node through the network by entering a buffer (queue) of a certain length in each node and waiting for their turn to be transmitted to the next node. Also, call access to a network with a given capacity is modeled as a process with certain distribution of call arrival times and certain...

A new queueing strategy for the Adversarial Queueing Theory

In the today’s Internet and TCP/IPnetworks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are researched in this model and better results are performed by alternative queueing strategies, e.g. LIS (Longest In System). This article introduces a new que...

Queueing Theory with Reneging

The literature on queueing with reneging is reviewed. Only random (Poisson) arrivals and unlimited capacity queues are considered, although some of the references also contain results for other arrival distributions or finite capacity queues. The paper focuses on the probability of service under steady state conditions; results for other metrics such as the expected waiting time may be found in...